/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */

/**
 * @param {TreeNode} root
 * @param {TreeNode} p
 * @param {TreeNode} q
 * @return {TreeNode}
 */
var lowestCommonAncestor = function(root, p, q) {
    if(!root) return null 
    if(!root.left && !root.right) return root 
    // 如果有左或者右子树
};


const node = {
    val: 123,
    left: {
        val:1,
        left: {
            val:10
        },
        right: {
            val:12
        }
    },
    right: {
        val: 10,
        left: {
            val: 19,
            left: {
                val:11
            },
            right: {
                val: 111,
                left: {
                    val:10
                }
            }
        },
        right: {
            val: 0,
            left: {
                left: 19,
                right:{
                    val:09
                }
            },
            right: {
                val:30,
                left: {
                    val:30,
                    right: {
                        val:59
                    }
                }
            }
        }
    }
}


let arr1 = [
    {id:1},
    {id:2},
    {id:3},
    {id:4}
]

let arr2 = [
    {id:5},
    {id:6},
    {id:7},
    {id:8},
    {id:9},
]

// 如果没有..., 那么就是直接将数据放进去
let arrs= [arr1,arr2]
console.log(arrs);